全文获取类型
收费全文 | 971篇 |
免费 | 14篇 |
国内免费 | 50篇 |
专业分类
化学 | 17篇 |
力学 | 23篇 |
综合类 | 3篇 |
数学 | 932篇 |
物理学 | 60篇 |
出版年
2023年 | 11篇 |
2022年 | 18篇 |
2021年 | 17篇 |
2020年 | 19篇 |
2019年 | 26篇 |
2018年 | 20篇 |
2017年 | 19篇 |
2016年 | 15篇 |
2015年 | 13篇 |
2014年 | 36篇 |
2013年 | 155篇 |
2012年 | 28篇 |
2011年 | 49篇 |
2010年 | 44篇 |
2009年 | 88篇 |
2008年 | 72篇 |
2007年 | 62篇 |
2006年 | 54篇 |
2005年 | 30篇 |
2004年 | 29篇 |
2003年 | 28篇 |
2002年 | 21篇 |
2001年 | 13篇 |
2000年 | 17篇 |
1999年 | 23篇 |
1998年 | 21篇 |
1997年 | 23篇 |
1996年 | 20篇 |
1995年 | 17篇 |
1994年 | 8篇 |
1993年 | 9篇 |
1992年 | 3篇 |
1991年 | 2篇 |
1990年 | 4篇 |
1989年 | 3篇 |
1987年 | 2篇 |
1985年 | 4篇 |
1984年 | 4篇 |
1983年 | 2篇 |
1982年 | 2篇 |
1981年 | 2篇 |
1980年 | 1篇 |
1979年 | 1篇 |
排序方式: 共有1035条查询结果,搜索用时 15 毫秒
1.
2.
本文对一类具有对称轴的图A_n(n≥0),得到了它的特征多项式及匹配多项式的精确表达式;同时还得到A_(?)的完美匹配数。 相似文献
3.
Yuanqiu Huang 《Discrete Applied Mathematics》2007,155(3):405-409
A stable set of a graph is a vertex set in which any two vertices are not adjacent. It was proven in [A. Brandstädt, V.B. Le, T. Szymczak, The complexity of some problems related to graph 3-colorability, Discrete Appl. Math. 89 (1998) 59-73] that the following problem is NP-complete: Given a bipartite graph G, check whether G has a stable set S such thatG-Sis a tree. In this paper we prove the following problem is polynomially solvable: Given a graph G with maximum degree 3 and containing no vertices of degree 2, check whether G has a stable set S such thatG-Sis a tree. Thus we partly answer a question posed by the authors in the above paper. Moreover, we give some structural characterizations for a graph G with maximum degree 3 that has a stable set S such that G-S is a tree. 相似文献
4.
M.Z. Arslanov 《Operations Research Letters》2007,35(5):636-644
We consider the problem of guillotine cutting a rectangular sheet into two rectangular pieces without rotations. The question is whether there exists a cutting pattern with given numbers of occurrences of both rectangular pieces. A polynomial time algorithm is described to construct the convex hull of solutions to this problem. 相似文献
5.
On Polynomial Functions over Finite Commutative Rings 总被引:1,自引:0,他引:1
Jian Jun JIANG Guo Hua PENG Qi SUN Qi Fan ZHANG 《数学学报(英文版)》2006,22(4):1047-1050
Let R be an arbitrary finite commutative local ring. In this paper, we obtain a necessary and sufficient condition for a function over R to be a polynomial function. Before this paper, necessary and sufficient conditions for a function to be a polynomial function over some special finite commutative local rings were obtained. 相似文献
6.
Let E\subset \Bbb R
s
be compact and let d
n
E
denote the dimension of the space of polynomials of degree at most n in s variables restricted to E . We introduce the notion of an asymptotic interpolation measure (AIM). Such a measure, if it exists , describes the asymptotic behavior of any scheme τ
n
={ \bf x
k,n
}
k=1
dnE
, n=1,2,\ldots , of nodes for multivariate polynomial interpolation for which the norms of the corresponding interpolation operators do
not grow geometrically large with n . We demonstrate the existence of AIMs for the finite union of compact subsets of certain algebraic curves in R
2
. It turns out that the theory of logarithmic potentials with external fields plays a useful role in the investigation. Furthermore,
for the sets mentioned above, we give a computationally simple construction for ``good' interpolation schemes.
November 9, 2000. Date revised: August 4, 2001. Date accepted: September 14, 2001. 相似文献
7.
Popularized by Zassenhaus in the seventies, several algorithms for factoring polynomials use a so-called lifting and recombination scheme. Concerning bivariate polynomials, we present a new algorithm for the recombination stage that requires a lifting up to precision twice the total degree of the polynomial to be factored. Its cost is dominated by the computation of reduced echelon solution bases of linear systems. We show that our bound on precision is asymptotically optimal.
8.
In this paper we characterize the local maxima of a continuous global optimization formulation for finding the independence
number of a graph. Classical Karush-Kuhn-Tucker conditions and simple combinatorial arguments are found sufficient to deduce
several interesting properties of the local and global maxima. These properties can be utilized in developing new approaches
to the maximum independent set problem. 相似文献
9.
Comparison of Two Reformulation-Linearization Technique Based Linear Programming Relaxations for Polynomial Programming Problems 总被引:3,自引:0,他引:3
In this paper, we compare two strategies for constructing linear programmingrelaxations for polynomial programming problems using aReformulation-Linearization Technique (RLT). RLT involves an automaticreformulation of the problem via the addition of certain nonlinear impliedconstraints that are generated by using the products of the simple boundingrestrictions (among other products), and a subsequent linearization based onvariable redefinitions. We prove that applying RLT directly to the originalpolynomial program produces a bound that dominates in the sense of being atleast as tight as the value obtained when RLT is applied to the jointcollection of all equivalent quadratic problems that could be constructed byrecursively defining additional variables as suggested by Shor. 相似文献
10.
Josef Obermaier 《Journal of Approximation Theory》2003,125(2):303-312
Let
be compact with #S=∞ and let C(S) be the set of all real continuous functions on S. We ask for an algebraic polynomial sequence (Pn)n=0∞ with deg Pn=n such that every fC(S) has a unique representation f=∑i=0∞ αiPi and call such a basis Faber basis. In the special case of
, 0<q<1, we prove the existence of such a basis. A special orthonormal Faber basis is given by the so-called little q-Legendre polynomials. Moreover, these polynomials state an example with A(Sq)≠U(Sq)=C(Sq), where A(Sq) is the so-called Wiener algebra and U(Sq) is the set of all fC(Sq) which are uniquely represented by its Fourier series. 相似文献